- pseudorandom sequences
- Макаров: псевдослучайные последовательности
Универсальный англо-русский словарь. Академик.ру. 2011.
pseudorandom sequences
Смотреть что такое "pseudorandom sequences" в других словарях:
Pseudorandom number generator — A pseudorandom number generator (PRNG), also known as a deterministic random bit generator (DRBG),[1] is an algorithm for generating a sequence of numbers that approximates the properties of random numbers. The sequence is not truly random in… … Wikipedia
Pseudorandom noise — In cryptography, pseudorandom noise (PRN[1][2]) is a signal similar to noise which satisfies one or more of the standard tests for statistical randomness. Although it seems to lack any definite pattern, pseudorandom noise consists of a… … Wikipedia
Pseudorandom generator theorem — In computational complexity a distribution is considered pseudorandom if no efficient computation can distinguish it from the true uniform distribution by a non negligible advantage. Formally, a family of distributions Dn is pseudorandom if for… … Wikipedia
Pseudorandom binary sequence — A binary sequence (BS) is a sequence of N bits, :a j for j=0,1,...,N 1, i.e. m ones and N m zeros. A BS is pseudo random (PRBS) if its autocorrelation function :C(v)=sum {j=0}^{N 1} a ja {j+v}has only two values::C(v)=egin{cases}m, mbox{ if }… … Wikipedia
Cryptographically secure pseudorandom number generator — A cryptographically secure pseudo random number generator (CSPRNG) is a pseudo random number generator (PRNG) with properties that make it suitable for use in cryptography. Many aspects of cryptography require random numbers, for example: Key… … Wikipedia
Complementary sequences — For complementary sequences in biology, see complementarity (molecular biology). In applied mathematics, complementary sequences (CS) are pairs of sequences with the useful property that their out of phase aperiodic autocorrelation coefficients… … Wikipedia
Naor-Reingold Pseudorandom Function — In 1997, Moni Naor and Omer Reingold described efficient constructions for various cryptographic primitives in private key as well as public key cryptography. Their result is the construction of an efficient pseudorandom function. Let p and l be… … Wikipedia
Pseudorandomness — A pseudorandom process is a process that appears random but is not. Pseudorandom sequences typically exhibit statistical randomness while being generated by an entirely deterministic causal process. Such a process is easier to produce than a… … Wikipedia
Monte Carlo method — Not to be confused with Monte Carlo algorithm. Computational physics … Wikipedia
Viterbi School of Engineering — The Viterbi School of Engineering (formerly the USC School of Engineering) is located at the University of Southern California in the United States. It was renamed following a $52 million donation by Andrew Viterbi. The USC Viterbi School of… … Wikipedia
Fisher-Yates shuffle — The Fisher Yates shuffle, named after Ronald Fisher and Frank Yates, also known as the Knuth shuffle, after Donald Knuth, is an algorithm for generating a random permutation of a finite set in plain terms, for randomly shuffling the set. A… … Wikipedia
